an effective optimization algorithm for locally nonconvex lipschitz functions based on mollifier subgradients

An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients

An Effective Optimization Algorithm for Locally Nonconvex Lipschitz Functions Based on Mollifier Subgradients

We present an effective algorithm for minimization of locally nonconvex Lipschitz functions based on mollifier functions approximating the Clarke generalized gradient. To this aim, first we approximate the Clarke generalized gradient by mollifier subgradients. To construct this approximation, we use a set of averaged functions gradients. Then, we show that the convex hull of this set serves as ...

An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization

This paper is about distributed derivative-based algorithms for solving optimization problems with a separable (potentially nonconvex) objective function and coupled affine constraints. A parallelizable method is proposed that combines ideas from the fields of sequential quadratic programming and augmented Lagrangian algorithms. The method negotiates shared dual variables that may be interprete...

ε-subgradient algorithms for locally lipschitz functions on Riemannian manifolds

This paper presents a descent direction method for finding extrema of locally Lipschitz functions defined on Riemannian manifolds. To this end we define a set-valued mapping x → ∂εf(x) named ε-subdifferential which is an approximation for the Clarke subdifferential and which generalizes the Goldstein-ε-subdifferential to the Riemannian setting. Using this notion we construct a steepest descent ...

A Derivative-free Method for Linearly Constrained Nonsmooth Optimization

This paper develops a new derivative-free method for solving linearly constrained nonsmooth optimization problems. The objective functions in these problems are, in general, non-regular locally Lipschitz continuous function. The computation of generalized subgradients of such functions is difficult task. In this paper we suggest an algorithm for the computation of subgradients of a broad class ...

Locally Lipschitz Functions and Bornological Derivatives

We study the relationships between Gateaux, Weak Hadamard and Fréchet differentiability and their bornologies for Lipschitz and for convex functions. AMS Subject Classification. Primary: 46A17, 46G05, 58C20. Secondary: 46B20.